Complexity of vehicle routing and scheduling problems
نویسندگان
چکیده
منابع مشابه
On the Reformulation of Vehicle Routing Problems and Scheduling Problems
We can reformulate a vehicle routing problem (VRP) as an open shop scheduling problem (SSP) by representing visits as activities, vehicles as resources on the factory floor, and travel as set up costs between activities. In this paper we present two reformulations: from VRP to open shop, and the inverse, from SSP to VRP. Not surprisingly, VRP technology performs poorly on reformulated SSP’s, as...
متن کاملEfficient Insertion Heuristics for Vehicle Routing and Scheduling Problems
Insertion heuristics have proven to be popular methods for solving a variety of vehicle routing and scheduling problems. In this paper, we focus on the impact of incorporating complicating constraints on the efficiency of insertion heuristics. The basic insertion heuristic for the standard vehicle routing problem has a time complexity of O(n). However, straightforward implementations of handlin...
متن کاملSTOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملComplexity results and competitive analysis for vehicle routing problems
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملOnline vehicle routing problems
The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years; two entire monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard, polynomial-time approximation algorithms are usually studied. However, usually the approaches to the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 1981
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.3230110211